Recent developments in graph Ramsey theory
نویسندگان
چکیده
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring of the edges of KN contains a monochromatic copy of H. The existence of these numbers has been known since 1930 but their quantitative behaviour is still not well understood. Even so, there has been a great deal of recent progress on the study of Ramsey numbers and their variants, spurred on by the many advances across extremal combinatorics. In this survey, we will describe some of this progress.
منابع مشابه
Homogeneous Structures
A relational first order structure is homogeneous if every isomorphism between finite substructures extends to an automorphism. Familiar examples of such structures include the rational numbers with the usual order relation, the countable random and so called Rado graph, and many others. Countable homogeneous structures arise as Fraı̈ssé limits of amalgamation classes of finite structures, and h...
متن کاملAll Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملErgodic Ramsey theory: a dynamical approach to static theorems
We discuss classical results of Ramsey theory together with their dynamical counterparts, survey recent developments and formulate some natural open questions and conjectures. Mathematics Subject Classification (2000). Primary 28D15, 05D10; Secondary 37A45, 37B10.
متن کاملRecent Progress in Ramsey Theory on the Integers
We give a brief survey of some recent developments in Ramsey theory on the set of integers and mention several unsolved problems, giving a partial answer to one. –For Ron Graham on his 70th birthday
متن کاملA survey of quantitative bounds for hypergraph Ramsey problems
The classical hypergraph Ramsey number rk(s, n) is the minimum N such that for every redblue coloring of the k-tuples of {1, . . . , N}, there are s integers such that every k-tuple among them is red, or n integers such that every k-tuple among them is blue. We survey a variety of problems and results in hypergraph Ramsey theory that have grown out of understanding the quantitative aspects of r...
متن کامل